Taylor approximation for symmetric level-index arithmetic processing
نویسندگان
چکیده
Symmetric level-index arithmetic was introduced to overcome the problems of overflow and underflow in the floating-point system. The purpose of this paper is to improve the algorithm performance of SLI arithmetic by introducing an approximation scheme using Taylor’s expansion. Following a brief summary of the SLI system and its algorithm for addition/subtraction, the deduction and analysis of Taylor approximation are presented. Also some results from numerical experiments and timing comparisons on possible implementations show the advantage of the approximation method.
منابع مشابه
High level Ab inito bench mark computaions on weak interactions (H2)2 dimer revisited
The Potential Energy Surface PES of (H2)2 dimer has been investigated, using five simple rigid rotor models. These models are called: head to head, symmetric side to side, L , steplike and T model. All calculations were done at two levels of ab initio methods: MP2(Full) and QCISD (T,Full) using cc-pVTZ basis set at singlet state of spin multiplicity. The results of scanning PES were then fitte...
متن کاملTowards a Fast and Reliable Software Implementation of SLI-FLP Hybrid Computer Arithmetic
In this paper we describe a C++ implementation of a hybrid system combining SLI (symmetric level-index) arithmetic and FLP (floating-point) arithmetic. The principal motivation for the work to be presented is to promote the use of SLI arithmetic as a practical framework for scientific computing. This hybrid arithmetic is essentially overflow and underflow free, and its implementation has shown ...
متن کاملError-Bounding in Level-Index Computer Arithmetic
This paper proposes the use of level-index (LI) and symmetric level-index (SLI) computer arithmetic for practical computation with error bounds. Comparisons are made with oating-point and several advantages are identiied.
متن کاملBasic Linear Algebra Operations in SLI Arithmetic
Symmetric level-index arithmetic was introduced to overcome recognized limitations of oating-point systems, most notably overrow and un-derrow. The original recursive algorithms for arithmetic operations could be parallelized to some extent, particularly when applied to extended sums or products, and a SIMD software implementation of some of these algorithms is described. The main purpose of th...
متن کاملOn the Redundancy of Real Number Representation Systems on the Redundancy of Real Number Representation Systems on the Redundancy of Real Number Representation Systems
In this paper a set of de nitions describing general real number representation sys tems is presented Our purpose is to nd a su ciently wide model de nition including classical systems signed digit notation linear numeration systems p adic numbers symmetric level index arithmetic but speci c enough to make it possible to build some practical results We focuse on the redundancy property and the ...
متن کامل